You are here: irt.org | FOLDOC | post office problem
<algorithm> Given a set of points (in N dimensions), find another point which minimises the sum of the distances from that point to each of the others.
(2007-03-07)
Nearby terms: PostgreSQL « posting « postmaster « post office problem » Post Office Protocol » post-order traversal » POSTQUEL
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL